Improved Deterministic Parallel Padded Sorting
نویسندگان
چکیده
Given an input array of n real numbers, sorting with padding consists in writing those numbers in order in an array of size (1 +)n, thus leaving n entries empty. Only comparisons are allowed between the numbers to be sorted. We describe an algorithm that, with nk processors in the CRCW PRAM model, sorts the input array with padding o(1) using time O(log k n log (log k n) + loglog k). This improves a previous algorithm with time bound O(log k n (loglog k) 3 2 C(log n?log k)). The best known lower bound is (log k n).
منابع مشابه
Approximate Compaction and Padded-Sorting on Exclusive Write PRAMs
Padded-sorting is a task of placing input items in an array in a nondecreasing order, but with free space between consecutive elements allowed. For many applications, paddedsorting is as useful as sorting. Approximate compaction and compression are closely related problems. It is known that time complexity of padded-sorting on randomized CRCW PRAMs is considerably lower than time complexity of ...
متن کاملApproximate compaction and padded - sortingon
Padded-sorting is a task of placing input items in an array in a nondecreasing order, but with free space between consecutive elements allowed. For many applications, padded-sorting is as useful as sorting. Approximate compaction and compression are closely related problems. It is known that time complexity of padded-sorting on randomized CRCW PRAMs is dramatically lower than time complexity of...
متن کاملOptimal deterministic approximate parallel prefix sums and their applications
We show that extremely accurate approximation to the preex sums of a sequence of n integers can be computed deterministically in O(loglog n) time using O(n= loglog n) processors in the Common CRCW PRAM model. This complements randomized approximation methods obtained recently by Goodrich, Ma-tias and Vishkin and improves previous deterministic results obtained by Hagerup and Raman. Furthermore ...
متن کاملWaste Makes Haste: Tight Bounds for Loose Parallel Sorting
Conventional parallel sorting requires the n input keys to be output in an array of size n, and is known to take fl(log n/log log n) time using any polynomial number of processors. The lower bound does not apply to the more "wasteful" convention of padded sorting, which requires the keys to be output in sorted order in an array of size (1 + o(1))n. We give very fast randomized CRCW PRAM algorit...
متن کاملThe Random Adversary: A Lower-Bound Technique for Randomized Parallel Algorithms
The random-adversary technique is a general method for proving lower bounds on randomized parallel algorithms. The bounds apply to the number of communication steps, and they apply regardless of the processors’ instruction sets, the lengths of messages, etc. This paper introduces the random-adversary technique and shows how it can be used to obtain lower bounds on randomized parallel algorithms...
متن کامل